Tight sets, weighted m -covers, weighted m -ovoids, and minihypers

نویسندگان

  • Jan De Beule
  • Patrick Govaerts
  • Anja Hallez
  • Leo Storme
چکیده

Minihypers are substructures of projective spaces introduced to study linear codes meeting the Griesmer bound. Recently, many results in finite geometry were obtained by applying characterization results on minihypers [8, 17, 18]. In this paper, using characterization results on certain minihypers, we present new results on tight sets in classical finite polar spaces and weighted m-covers, and on weighted m-ovoids of classical finite generalized quadrangles. The link with minihypers gives us characterization results of i-tight sets in terms of generators and Baer subgeometries contained in the hermitian and symplectic polar spaces, and in terms of generators for the quadratic polar spaces. We also present extendability results on partial weighted m-ovoids and partial weighted m-covers, having small deficiency, to weighted m-covers and weighted m-ovoids of classical finite generalized quadrangles. As a particular application, we prove in an alternative way the extendability of 53-, 54-, and 55-caps of PG(5, 3), contained in a non-singular elliptic quadric Q−(5, 3), to 56-caps contained in this elliptic quadric Q−(5, 3).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear codes meeting the Griesmer bound, minihypers, and geometric applications

Coding theory and Galois geometries are two research areas which greatly influence each other. In this talk, we focus on the link between linear codes meeting the Griesmer bound and minihypers in finite projective spaces. Minihypers are particular (multiple) blocking sets. We present characterization results on minihypers, leading to equivalent characterization results on linear codes meeting t...

متن کامل

On weighted { δv μ + 1 , δv μ ; k − 1 , q } - minihypers , q square

Weighted minihypers have recently received a lot of attention. They originated as geometrical equivalents of linear codes meeting the Griesmer bound, but have also been investigated for their importance in solving geometrical problems. Storme characterized weighted {δ(q+1), δ; k−1, q}-minihypers, q square, as a sum of lines and Baer subgeometries PG(3, √ q), provided δ is sufficiently small. Th...

متن کامل

New classification results for a certain class of weighted minihypers

Minihypers were introduced for their relation with linear codes meeting the Griesmer bound. Results on minihypers have therefore important applications in coding theory. On the other hand, minihypers are nice geometrical structures since they are a generalization of blocking sets, which have been studied a lot. Therefore also minihypers deserve to be studied from a purely geometrical point of v...

متن کامل

Weighted similarity measure on interval-valued fuzzy sets and its application to pattern recognition

A new approach to define the similarity measure betweeninterval-valued fuzzy sets is presented. The proposed approach isbased on a weighted measure in which the normalized similaritiesbetween lower functions and also between upper functions arecombined by a weight parameter. The properties of this similaritymeasure are investigated. It is shown that, the proposed measurehas some advantages in c...

متن کامل

Tight sets and m-ovoids of generalised quadrangles

The concept of a tight set of points of a generalised quadrangle was introduced by S. E. Payne in 1987, and that of an m-ovoid of a generalised quadrangle was introduced by J. A. Thas in 1989, and we unify these two concepts by defining intriguing sets of points. We prove that every intriguing set of points in a generalised quadrangle is an m-ovoid or a tight set, and we state an intersection r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2009